n = 2
def numWays(n: int) -> int:
    if n==0 or n==1:
        return 1
    if n==2:
        return 2
    dp=[0 for _ in range(n+1)]

    dp[0],dp[1],dp[2]=1,1,2

    for i in range(3,n+1):
        dp[i]=dp[i-1]+dp[i-2]

    print(dp)


numWays(n)